feat: added manacher algorithm#178
Merged
Merged
Conversation
There was a problem hiding this comment.
Pull Request Overview
This PR implements Manacher's algorithm for finding the longest palindromic substring in R, providing an efficient O(n) solution compared to naive O(n³) approaches. The implementation handles both odd and even length palindromes using a modified string representation with separators.
- Implements linear-time Manacher's algorithm for palindrome detection
- Uses string preprocessing with '#' separators to handle even-length palindromes
- Includes interactive input functionality with case-insensitive processing
Tip: Customize your code reviews with copilot-instructions.md. Create the file or learn how to get started.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Uh oh!
There was an error while loading. Please reload this page.